|
課程名稱 |
演算法
Algorithms |
|
開課學期 |
101-1 |
|
授課對象 |
學程 積體電路設計第二專長學程 |
|
授課教師 |
張耀文 |
|
課號 |
EE4033 |
|
課程識別碼 |
901 39000 |
|
班次 |
|
|
學分 |
3 |
|
全/半年 |
半年 |
|
必/選修 |
選修 |
|
上課時間 |
星期四6,7,8(13:20~16:20) |
|
上課地點 |
博理112 |
|
備註 |
總人數上限：80人 |
|
|
|
|
課程簡介影片 |
|
|
核心能力關聯 |
核心能力與課程規劃關聯圖 |
|
課程大綱
|
|
為確保您我的權利,請尊重智慧財產權及不得非法影印
|
|
課程概述 |
COURSE CONTENTS: TOPICS INCLUDE
1. ALGORITHMIC FUNDAMENTALS: MATHEMATICAL FOUNDATIONS, GROWTH OF FUNCTIONS, RECURRENCES (5 HRS)
2. SORTING AND ORDER STATISTICS (5 HRS)
3. DATA STRUCTURES: HEAP, BINARY SEARCH TREES, RB TREES, DISJOINT SETS (4 HRS)
4. ADVANCED DESIGN AND ANALYSIS TECHNIQUES: DYNAMIC PROGRAMMING, GREEDY ALGORITHMS, AMORTIZED ANALYSIS (11 HRS)
5. GRAPH ALGORITHMS: GRAPH REPRESENTATIONS, SEARCHING, MINIMUM SPANNING TREES, SHORTEST PATHS, MATCHING, NETWORK FLOW (14 HRS)
6. NP-COMPLETENESS, COMPUTATIONAL COMPLEXITY, AND APPROXIMATION ALGORITHMS (6 HRS)
7. GENERAL-PURPOSE ALGORITHMS: COMPUTATIONAL GEOMETRY,
BRANCH AND BOUND, AND SIMULATED ANNEALING, AS TIME PERMITS.
|
|
課程目標 |
COURSE OBJECTIVE: FOCUSES ON THE DESIGN AND ANALYSIS OF ALGORITHMS AND THEIR APPLICATIONS, AND DEVELOPS PROBLEM-SOLVING TECHNIQUES. |
|
課程要求 |
PREREQUISITES: DATA STRUCTURES (OR DISCRETE MATHEMATICS).
SIX HOMEWORK ASSIGNMENTS (+ IN-CLASS QUIZZES) 30%,
THREE MINI PROGRAMMING ASSIGNMENTS 20%,
TWO IN-CLASS TESTS 50%,
AND BONUSES FOR CLASS PARTICIPATION. |
|
預期每週課後學習時數 |
|
|
Office Hours |
|
|
指定閱讀 |
|
|
參考書目 |
TEXTBOOK
T. H. CORMEN, C. E. LEISERSON, R. L. RIVEST,
AND C. STEIN, INTRODUCTION TO ALGORITHMS, 3RD ED.,
MIT PRESS/MCGRAW HILL, 2009. ISBN:
0-262-03384-4/978-0-262-03384-8. |
|
評量方式
(僅供參考) |
|
|